RPSGAe – Reduced Pareto Set Genetic Algorithm: A Multiobjective Genetic Algorithm with Elitism

نویسنده

  • A. Gaspar-Cunha
چکیده

In this paper a Multiobjective Optimization Genetic Algorithm, named Reduced Pareto Set Genetic Algorithm with Elitism (RPSGAe), is presented and its performance assessed. The algorithm is compared with other MOEA ́s using three difficult problems from the literature and a sophisticated statistical comparison technique. The preliminary results obtained showed that the RPSGAe outperform the other algorithms tested.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

The Use of Evolutionary Algorithms to Solve Practical Problems in Polymer Extrusion

This work aims at selecting the operating conditions and designing screws that optimize the performance of single-screw and co-rotating twin-screw extruders, which are machines widely used by the polymer processing industry. A special MOEA, denoted as Reduced Pareto Set Genetic Algorithm, RPSGAe, is presented and used to solve these multiobjective combinatorial problems. Twin screw design is fo...

متن کامل

A Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem

The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...

متن کامل

A Multiobjective Genetic Algorithm for Radio Network Optimization

Engineering of mobile telecommunication networks endures two major problems: the design of the network, and the frequency assignment. We address the first problem in this paper, which has been formulated as a multiobjective constrained combinatorial optimisation problem. We propose a genetic algorithm that aims to approximate the Pareto frontier of the problem. Advanced techniques have been use...

متن کامل

DGA and Pareto Elitism : Improving Pareto

Previous works have shown the eeciency of a new approach for the Genetic Algorithms, the Dual Genetic Algorithms, in the multiobjective optimization context. Dual Genetic Algorithms make use of a meta level to enhance the expressiveness of schemata, entities implicitly handle by Genetic Algorithms. In this paper, we show that this approach, coupled with a new method, Pareto Elitism, leads to ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002